Grassmann Registration Manifolds for Face Recognition

نویسندگان

  • Yui Man Lui
  • J. Ross Beveridge
چکیده

Motivated by image perturbation and the geometry of manifolds, we present a novel method combining these two elements. First, we form a tangent space from a set of perturbed images and observe that the tangent space admits a vector space structure. Second, we embed the approximated tangent spaces on a Grassmann manifold and employ a chordal distance as the means for comparing subspaces. The matching process is accelerated using a coarse to fine strategy. Experiments on the FERET database suggest that the proposed method yields excellent results using both holistic and local features. Specifically, on the FERET Dup2 data set, our proposed method achieves 83.8% rank 1 recognition: to our knowledge the currently the best result among all non-trained methods. Evidence is also presented that peak recognition performance is achieved using roughly 100 distinct perturbed images.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of Humans and their Activities using Statistical analysis on Stiefel and Grassmann Manifolds

Many applications in computer vision involve learning and recognition of patterns from exemplars which lie on certain manifolds. Given a database of examples and a query, the following two questions are usually addressed – a) what is the ‘closest’ example to the query in the database ? b) what is the ‘most probable’ class to which the query belongs ? The answer to the first question involves st...

متن کامل

Building Deep Networks on Grassmann Manifolds

Learning representations on Grassmann manifolds is popular in quite a few visual recognition tasks. In order to enable deep learning on Grassmann manifolds, this paper proposes a deep network architecture by generalizing the Euclidean network paradigm to Grassmann manifolds. In particular, we design full rank mapping layers to transform input Grassmannian data to more desirable ones, exploit re...

متن کامل

New Strategies for Data Analysis and Optimization on Riemannian Manifolds

How can video clips be analyzed to describe organic human actions automatically? How can the long-wave infrared spectrum of an underwater object be identified when the water is distorting the signature of the target? If you had the reflection of an image from a fun-house mirror, could you recognize the original image? My research focuses on geometric analysis of high dimensional data, and inclu...

متن کامل

Mean Polynomial Kernel and Its Application to Vector Sequence Recognition

SUMMARY Classification tasks in computer vision and brain-computer interface research have presented several applications such as biometrics and cognitive training. However, like in any other discipline, determining suitable representation of data has been challenging, and recent approaches have deviated from the familiar form of one vector for each data sample. This paper considers a kernel be...

متن کامل

Efficient Algorithms for Inferences on Grassmann Manifolds

Linear representations and linear dimension reduction techniques are very common in signal and image processing. Many such applications reduce to solving problems of stochastic optimizations or statistical inferences on the set of all subspaces, i.e. a Grassmann manifold. Central to solving them is the computation of an “exponential” map (for constructing geodesics) and its inverse on a Grassma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008